Contextual Processing of Graphs using Self-Organizing Maps

This paper introduces a novel approach to Self-Organizing Maps which is capable of processing graphs such that the context of vertices and sub-graphs are considered in the mapping process. The result is that any vertex in a graph is mapped onto an n-dimensional map depending on its label and the graph structure as a whole. Experimental results demonstrate that the proposed approach achieves the desired outcomes.